Modified shifted variable metric algorithms for solving unconstrained minimization problems
نویسندگان
چکیده
منابع مشابه
Limited-memory projective variable metric methods for unconstrained minimization
A new family of limited-memory variable metric or quasi-Newton methods for unconstrained minimization is given. The methods are based on a positive definite inverse Hessian approximation in the form of the sum of identity matrix and two low rank matrices, obtained by the standard scaled Broyden class update. To reduce the rank of matrices, various projections are used. Numerical experience is e...
متن کاملComputational experience with improved variable metric methods for unconstrained minimization
Institute of Mathematics of the Academy of Sciences of the Czech Republic provides access to digitized documents strictly for personal use. Each copy of any part of this document must contain these Terms of use. This paper has been digitized, optimized for electronic delivery and stamped with digital signature within the project DML-CZ: The Czech Digital Mathematics Library The paper describes ...
متن کاملSelf-Scaling Variable Metric Algorithms Without Line Search for Unconstrained Minimization*
This paper introduces a new class of quasi-Newton algorithms for unconstrained minimization in which no line search is necessary and the inverse Hessian approximations are positive definite. These algorithms are based on a two-parameter family of rank two, updating formulae used earlier with line search in self-scaling variable metric algorithms. It is proved that, in a quadratic case, the new ...
متن کاملA Combined Variable Metric - Conjugate Gradient Algorithm for a Class of Large Scale Unconstrained Minimization Problems
An algorithm is being presented for a special class of unconstrained minimization problems. The algorithm exploits the special structure of the Hessian in the problems under consideration, It is based on applying Bertsekas' I-1] Scaled Partial Conjugate Gradient method with respect to a metric that is updated by the Rank One update, using gradients obtained in the preceeding steps. Two classes ...
متن کاملA variable order algorithm for unconstrained minimization
A variable order algorithm is proposed for the rini^ization of a function cff several variables. This algorithm has an order of convergence *.s high as four, good accuracy, and features a scalar subproblem at each iteration which may be along curved trajectories in the space of the independent variables. Numerical results en five standard test problems indicate superior performance when compare...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: JOURNAL OF EDUCATION AND SCIENCE
سال: 2010
ISSN: 2664-2530
DOI: 10.33899/edusj.2010.58398